Evaluating the complexity of Optimality Theory
نویسندگان
چکیده
Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993, 2004) is “in general computationally intractable” on the basis of a proof adapted from Eisner (1997a). We take issue with this conclusion on two grounds. First, the intractability result holds only in cases where the constraint set is not fixed in advance (contra usual definitions of OT) and second, the result crucially depends on a particular representation of OT grammars. We show that there is an alternative representation of OT grammars that allows for efficient computation of optimal surface forms and provides deeper insight into the sources of complexity of Optimality Theory. We conclude that it is a mistake to reject Optimality Theory on the grounds that it is computationally
منابع مشابه
Optimality Of Monetary And Fiscal Policies In Iran: An Application Of The Stochastic Optimal Control Theory
متن کامل
Ideas for Extending the Approach to Evaluating Health in All Policies in South Australia; Comment on “Developing a Framework for a Program Theory-Based Approach to Evaluating Policy Processes and Outcomes: Health in All Policies in South Australia”
Since 2008, the government of South Australia has been using a Health in All Policies (HiAP) approach to achieve their strategic plan (South Australia Strategic Plan of 2004). In this commentary, we summarize some of the strengths and contributions of the innovative evaluation framework that was developed by an embedded team of academic researchers. To inform how the use of HiAP is evaluated mo...
متن کاملRemarks and Replies Evaluating the Complexity of Optimality Theory
Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993, 2004) is ‘‘in general computationally intractable’’ on the basis of a proof adapted from Eisner 1997a. We take issue with this conclusion on two grounds. First, the intractability result holds only in cases where the constraint set is not fixed in advance (contra usual definitions of OT), and second, the result crucial...
متن کاملThe Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models
Despite the signi cant progress in multiagent teamwork, existing research does not address the optimality of its prescriptions nor the complexity of the teamwork problem. Without a characterization of the optimality-complexity tradeo s, it is impossible to determine whether the assumptions and approximations made by a particular theory gain enough eÆciency to justify the losses in overall perfo...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کامل